Method and apparatus for filtering email

ABSTRACT

A method and apparatus for filtering messages comprising determining a first semantic anchor corresponding to a first group of messages, for example, legitimate messages and a second semantic anchor corresponding to a second group of messages, for example, unsolicited messages. Determining a vector corresponding to an incoming message; comparing the vector corresponding to the incoming message with at least one of the first semantic anchor and the second semantic anchor to obtain a first comparison value and a second comparison value; and filtering the incoming message based on the first comparison value and the second comparison value.

This application is a continuation application of co-pending U.S. patent application Ser. No. 09/881,986, filed Jun. 14, 2001.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention relates generally to message filtering. More particularly, this invention relates to email filtering using latent semantic analysis.

COPYRIGHT NOTICE/PERMISSION

A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings hereto: Copyright© 2000, Apple Computer, Inc., All Rights Reserved.

BACKGROUND

As the use of computers and the Internet have proliferated, so too has the use of email. Many businesses and consumers use email as a prominent means of communication. Not surprisingly, the exponential growth of the medium has also attracted the interest of commercial email advertisers. Commercial email advertisers obtain email addresses from a variety of sources, for example, from email vendors, or from commercial web sites, often without the permission of the owners of the email addresses. The email addresses may then be used to promote the products and services of the commercial email advertisers, or of the parties they represent.

The result is a deluge of unsolicited email received by hapless email users. One method to deal with unsolicited email is for a user to manually select and delete the unsolicited email. Other methods provide for recognizing a message sent in bulk to multiple recipients, and to either discard or tag the message as a possible unsolicited message. Still other methods maintain a database of addresses of known senders of unsolicited email and on receipt of the email, automatically discard those received from the known senders of unsolicited email. Still other methods use key-word filters. This method provides for scanning the subject and/or the body of the email message for some pre-determined keywords, and if detected, the message may be either discarded or tagged as suspicious.

Despite the methods described above, commercial email advertisers use ingenious methods to frustrate the efforts of email recipients. For example, to defeat the detection of bulk email, the email messages may be routed through a maze of servers so that ultimately, the message does not appear to be a bulk emailing. To defeat the system that tracks the address of known senders of unsolicited messages, the originating address of the unsolicited email may be changed often. To confuse keyword filter methods, the subject field of the email may be deceitfully titled, for example, “In response to your query”. Moreover, the key-word filtering method suffers from other significant problems, for example, when trying to filter out email messages from pornographic email advertisers using the word “sex”, legitimate anatomical or biological articles that include the word “sex” may also be eliminated.

SUMMARY OF THE INVENTION

A method and apparatus for filtering messages, in particular email messages is described herein. According to one aspect of the present invention, the method comprises determining a first semantic anchor corresponding with a first group of messages, for example, legitimate email messages and a second semantic anchor corresponding with a second group of messages, for example, unsolicited email messages. The method further determines a vector corresponding with an incoming message, compares the vector with at least one of the first semantic anchor and the second semantic anchor to obtain at least one comparison value, and filters the incoming message based on the comparison value.

Embodiments of the invention may be represented as a software product stored on a machine-accessible medium (also referred to as a computer-accessible medium or a processor-accessible medium). According to one aspect of the invention, the machine-accessible medium includes instructions that, when executed by a machine causes the machine to perform operations comprising determining a first semantic anchor corresponding with a first group of messages, for example, legitimate email messages. The machine-accessible medium includes further instructions for determining a second semantic anchor corresponding with a second group of messages, for example, unsolicited email messages. The machine-accessible medium includes further instructions for determining a vector corresponding with an incoming message, compares the vector with at least one of the first semantic anchor and the second semantic anchor to obtain at least one comparison value, and filters the incoming message based on the comparison value.

According to one aspect of the invention, the invention may be represented as an apparatus, e.g. computer system. The computer system comprises a bus, a data storage device coupled to the bus and a processor coupled to the data storage device, said processor to perform a method that comprises determining a first semantic anchor corresponding to a first group of messages. The processor also determines a second semantic anchor corresponding to a second group of messages. The processor further determines a vector corresponding to an incoming message, compares the vector corresponding to the incoming message with at least one of the first semantic anchor and the second semantic anchor to obtain a first comparison value and a second comparison value. The processor filters the incoming message based on the first comparison value and the second comparison value.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:

FIG. 1 is a block diagram illustrating an email filtering system according to one embodiment of the present invention;

FIG. 2 is a block diagram of the matrices and vectors used in finding semantic anchors;

FIG. 3 is a flowchart illustrating a method used in filtering email according to one embodiment of the present invention;

FIG. 4 illustrates a block diagram of a computing device for use with one embodiment the present invention.

FIG. 5 illustrates a block diagram of one embodiment of the invention stored on a machine-accessible medium.

DETAILED DESCRIPTION

Described is a method and apparatus for filtering email using latent semantic analysis.

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known architectures, steps, and techniques have not been shown to avoid unnecessarily obscuring the present invention.

Parts of the description may be presented using terminology commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. Also, parts of the description may be presented in terms of operations performed through the execution of programming instructions. As well understood by those skilled in the art, these operations often take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, and otherwise manipulated through, for instance, electrical components.

The invention may utilize a distributed computing environment. In a distributed computing environment, program modules may be physically located in different local and remote memory storage devices. Execution of the program modules may occur locally in a stand-alone manner or remotely in a client/server manner. Examples of such distributed computing environments include local area networks, enterprise-wide computer networks, and the global Internet.

In addition, it should be understood that the programs, processes, method, etc. described herein are not related or limited to any particular computer or apparatus nor are they related or limited to any particular communication network architecture. Rather, various types of general purpose machines may be used with program modules constructed in accordance with the teachings described herein. Similarly, it may prove advantageous to construct a specialized apparatus to perform the method steps described herein by way of dedicated computer systems in a specific network architecture with hard-wired logic or programs stored in nonvolatile memory such as read only memory.

Various operations will be described as multiple discrete steps performed in turn in a manner that is helpful in understanding the present invention. However, the order of description should not be construed as to imply that these operations are necessarily performed in the order they are presented, or even order dependent. Lastly, repeated usage of the phrase “in one embodiment” does not necessarily refer to the same embodiment, although it may.

Latent semantic analysis (LSA) is a method that automatically uncovers the salient semantic relationships between words and documents in a given corpus. Discrete words are mapped onto a continuous semantic vector space, in which clustering techniques may be applied. The method for filtering email messages comprises determining a first semantic anchor corresponding with a first group of email messages, for example, legitimate email messages and a second semantic anchor corresponding with a second group of email messages, for example, unsolicited email messages. Determining a vector corresponding with an incoming email message, comparing the vector with at least one of the first semantic anchor and the second semantic anchor to obtain at least one comparison value, and filtering messages based on the comparison value.

FIG. 1 is a block diagram illustrating an email filtering system 100 according to one embodiment of the present invention. Although the description that follows describes the filtering of email messages, one skilled in the art will appreciate that the system may be used to filter email attachments, transcribed audio messages, computer programs, e.g., computer viruses, text, and the like. In one embodiment, email filtering system 100 filters unsolicited email messages from legitimate email messages. However, one skilled in the art will appreciate that other embodiments may classify messages into more than two groups.

Email filtering system 100 comprises an email training unit 105 that includes an email training corpus T, for example, a database comprising a collection of N₁ legitimate email messages and N₂ unsolicited email messages. In one embodiment, the legitimate and unsolicited email messages are obtained from the existing email received by a recipient. Alternate embodiments may allow for a user to manually classify each incoming email message until an adequate email training corpus T has been established. The words used in the collection of the legitimate email messages, and in the collection of the unsolicited email messages are from some underlying vocabulary v comprising, for example, the M most frequently used words in the language. In one embodiment, M may be ten thousand, and 1≧N₁=N₂≧150.

Co-occurrences unit 110 of email filtering system 100, comprises a two dimensional (M×2) matrix W formed using the email training corpus T. Matrix W essentially keeps track of which word is found in what document by keeping a record of the number of times each word appears in each legitimate and each unsolicited email message. In particular, entries ω_(ij) of matrix W reflects the extent to which each word ω_(i) ∈ v appeared in the legitimate email message (j=1), or in an unsolicited email message (i=2). Various methods may be used to keep a record of the number of occurrences of a word in a document, for example, a simple normalized count of the number of occurrences of each word. However, in one embodiment, co-occurrence unit 110 uses function $\begin{matrix} {\omega_{i,j} = {\left( {1 - ɛ_{i}} \right)\frac{c_{i,j}}{N_{j}}}} & (1) \end{matrix}$ that normalizes for document length and word entropy to form matrix W. c_(i,j) denotes the number of times each word ω_(i) occurs in the collection of legitimate email messages, and the number of times each word ω_(i) occurs in the collection of unsolicited email messages. In equation (1) N_(j), for j=1 and j=2, represents the total number of words in the collection of legitimate email messages, and unsolicited email messages. ε_(i) is the normalized entropy of ω_(i) in the training email corpus T. (1−ε_(i)) is merely a weighting factor, or a word distribution factor, and is a measure of the distribution of a particular word in the email training corpus T. This is explained further below.

In one embodiment, co-occurrences unit 110 calculates ε_(i) using equation: $\begin{matrix} {ɛ_{i} = {{- \frac{1}{\log\quad N}}{\sum\limits_{j = 1}^{N}{\frac{c_{i,j}}{t_{i}}\log\quad\frac{c_{i,j}}{t_{i}}}}}} & (2) \end{matrix}$ where N=N+N₂. By definition, 0≦ε_(i)≦1, with equality if and only if $c_{i,j} = {{t_{i}\quad{and}\quad c_{i,j}} = {\frac{t_{i}}{N}.}}$ Thus, a value of ε_(i) close to 1 indicates a word distributed across many email messages throughout the email training corpus T. However, a value of ε_(i) close to 0 indicates that the word is present only in a few email messages. Thus, the weighting factor is a measure of the distribution of a word across the training email corpus T. In particular, weighting factor (1−ε_(i)) is a measure of the indexing power of the word ω_(i).

After co-occurrences unit 110 constructs matrix W, Singular Value Decomposition (SVD) unit 115 decomposes matrix W, and subsequently obtains the semantic anchors {overscore (v)}₁ and {overscore (v)}₂. The semantic anchors {overscore (v)}₁ 120 and {overscore (v)}₂ 125 are vectors derived from matrix W using SVD. In one embodiment, vectors {overscore (v)}₁ and {overscore (v)}₂ are derived using the following equation: W=USV^(T)   (3) where U is the (M×2) left singular matrix with row vectors u_(i) (1≦i≦M), S is the (2×2) diagonal matrix of singular values s1≧s2≧0, V is the (2×2) right singular matrix with row vectors v_(j) (j=1,2), and T denotes matrix transposition. Thus, vector {overscore (v)}₁ represents legitimate email messages and vector {overscore (v)}₂ represents unsolicited email messages.

FIG. 2 is a block diagram of the SVD of matrix W. As FIG. 2 illustrates, the SVD of matrix W defines a mapping between the mathematical represepresentation of the set of legitimate and unsolicited email messages 205 and 210 respectively, and the latent semantic vector space spanned by the singular vectors contained in U and V. The mapping is then scaled by the diagonal matrix 230, to ensure proper representation. From this mapping, the first semantic anchor given by {overscore (v)}₁=v₁S   (4) and the second semantic anchor given by {overscore (v)}₂=v₂S   (5) are obtained after apropriate scaling by the diagonal matrix S. One skilled in the art will appreciate that V_(i) ^(T) 215 and V₂ ^(T) 220 are unscaled semantic anchors in (2×2) matrix V^(T) 235, and may be easily converted to 2-dimensional vectors {overscore (v)}₁ and {overscore (v)}₂ using the equations (4) and (5) above. If more thatn two classification groups are desired, i.e., classification groups other than legitimate and unsolicited, one skilled in the art will appreciate that semantic anchors corresponding to each classification group may be obtained as described above. Matrix U 240 is used to calculate the vector corresponding to an incoming email message as explained below.

Returning to FIG. 1, whenever an incoming email message is received by incoming email unit 150, equation 1 may be used by incoming email conversion unit 155 to convert the incoming email to a column vector d₃ of dimension M. In one embodiment, the resulting column vector d₃ may be inserted as an additional column in matrix W, thereby converting matrix W of dimension (M×2) into a matrix of dimension (M×3). Using the SVD of equation (2), an unscaled representation v₃ ^(T) of the new email message is obtained. Thus, d₃=USv₃ ^(T), and hence the vector representation of the incoming email is obtained as follows: {overscore (v)}₃=v₃S=d₃ ^(T)U   (6)

The 2-dimensional vector {overscore (v)}₃ of equation (6) is the mathematical representation of the new email message, and can be interpreted as a point in the latent semantic vector space spanned by vectors {overscore (v)}₁ and {overscore (v)}₂.

One skilled in the art will appreciate that equation (6) is an approximate representation of the message in the existing LSA space. Since the new email message was not part of the original SVD extraction, words in the new email message, not found in training corpus T may cause the SVD expansion to no longer apply. As such, in one embodiment, an optional feed back path 180, as illustrated in FIG. 1, may be used to add the new email message to the training corpus T. Semantic anchors {overscore (v)}₁ and {overscore (v)}₂ may be periodically recalculated to account for the new words in the new email messages, so that subsequent email messages may be accurately classified as legitimate or unsolicited.

The invention contemplates capturing structural associations between words. Hence, two words whose representations are “close” (in some suitable metric) tend to appear in the same kind of documents, whether or not they actually occur within identical word contexts in the documents. Each semantic anchor {overscore (v)}₁ and {overscore (v)}₂ may be viewed as the centroid of the words in the legitimate email messages, and in the unsolicited email messages respectively. This means that associated words such as synonyms occur in close proximity to other similar words in each category of the unsolicited and legitimate email messages in the semantic vector space S. For example, if a particular word is found more frequently in the unsolicited email messages as compared with legitimate email messages of the training corpus, an incoming email containing a synonym of the word will be closer to the unsolicited message category in semantic vector space S. Thus, email filtering system 100 properly classifies incoming email messages containing synonyms eliminating the need for frequent recalculations of semantic anchors {overscore (v)}₁ and {overscore (v)}₂.

After calculating the semantic anchors {overscore (v)}₁, {overscore (v)}₂, and the vector representation {overscore (v)}₃ of the new email message, a measure of closeness K is calculated. The measure of closeness K is a measure of how close a new email message is to a legitimate email message, or to an unsolicited email message. The measure of closeness K is computed by calculation unit 160 and, in one embodiment, compares the angle formed between vectors {overscore (v)}₁ and {overscore (v)}₃, with the angle formed between vectors {overscore (v)}₂ and {overscore (v)}₃. The measure of closeness K may be calculated using: $\begin{matrix} {{K\left( {{\overset{\_}{v}}_{3},{\overset{\_}{v}}_{j}} \right)} = {{\cos\left( {{v_{3}S},{v_{j}S}} \right)} = \frac{v_{3}S^{2}v_{j}^{T}}{{{v_{3}S}}{{v_{j}S}}}}} & (7) \end{matrix}$ for j=1, 2. Other methods may be employed to calculate the measure of closeness K including, but not limited to, calculating the length of the normals between vectors {overscore (v)}₁, {overscore (v)}₂, and {overscore (v)}₃.

After calculating the measure of closeness K, logic unit 165 determines whether the new email is unsolicited 170, legitimate 175, or ambiguous 180. In one embodiment, if {overscore (v)}₃ is closer to {overscore (v)}₁, i.e., the angle between {overscore (v)}₃ and {overscore (v)}₁ is smaller than the angle between {overscore (v)}₃ and {overscore (v)}₂, the new email is considered to be a legitimate email message 175, and email filtering system 100 may automatically permit the new email to be viewed by its intended recipient. Optionally, the email filtering system may allow the user to include the legitimate email message as part of the training email corpus T. Alternately, if {overscore (v)}₃ is closer to {overscore (v)}₂, i.e., the angle between {overscore (v)}₃ and {overscore (v)}₁ is greater than the angle between {overscore (3)}₃ and {overscore (v)}₂, the new email is considered unsolicited 170. In one embodiment, unsolicited email messages may be automatically discarded by the email filter system. Alternate embodiments may maintain a copy of the unsolicited email so that a user may, at the user's convenience, discard the unsolicited mail or include it to form part of the training email corpus T.

If the angle between {overscore (v)}₃ and {overscore (v)}₁ is approximately equal to the angle between {overscore (v)}₃ and {overscore (v)}₂, logic unit 165 may tag the email message as ambiguous 180, for example, with an icon to indicate an ambiguous email message. Alternate embodiments may tag each incoming email message with a unique tag for each of the unsolicited, legitimate, and ambiguous categories, allowing for ease in sorting and handling of the received email messages. With respect to ambiguous email messages, in one embodiment, a user may determine whether the email message is legitimate or unsolicited. Alternate embodiments may permit a user to discard the ambiguous email message, or include it, after removing the ambiguity, to form part of the training email corpus T, so that the ambiguity associated with future similar messages may be automatically handeled by email filtering system 100.

As an example consider the following email messages received by a person in the fishing business: (a) Fishing is excellent in the south bank of the river, and (b) The Merchant bank has high interest rates. Although both email messages have the word ‘bank’ in the text of the message, the method described will properly classify message (a) as a legitimate email message and message (b) as an unsolicited email message.

The email training corpus T is developed using existing email messages of the user in the fishing business. After the email training corpus T is generated by email training unit 105, co-occurrences unit 110 generates matrix W using the email training corpus T. SVD unit 115 decomposes matrix W and obtains semantic anchors {overscore (v)}₁ and {overscore (v)}₂. When the two email messages are received by the user in the fishing business, they are each converted to a vector {overscore (v)}₃ using equation 6 above. In one embodiment, for each email message the measure of closeness K between {overscore (v)}₁ and {overscore (v)}₃, and between {overscore (v)}₂ and {overscore (v)}₃ is calculated using equation 7. For legitimate email message (a), the measure of closeness K indicates that {overscore (v)}₃ is closer to {overscore (v)}₁ as compared with {overscore (v)}₂ thereby indicating the message is legitimate. However, for unsolicited message (b) the measure of closeness K will indicate that vector {overscore (v)}₃ is closer to unsolicited vector {overscore (v)}₂ as compared with {overscore (v)}₁ indicating that the message is unsolicited. Thus despite the same word ‘bank’ being present in each of the two email messages, the context in which they appear is taken into account in determining whether the received email message is legitimate or unsolicited.

FIG. 3 illustrates a method that may be used to filter email according to one embodiment of the invention. At 305 the email training corpus T is accessed, and at 310 the email messages in the training email corpus T are used to construct matrix W (described earlier) that essentially keeps track of which word is found in what document. In particular, matirx W maintains a record of the number of times each word appears in each legitimate and each unsolicited email message. In one embodiment, equation (1) is used to construct matrix W. After constructing matrix W, at 315 a SVD is performed using equation (3) and semantic anchors {overscore (v)}₁ and {overscore (v)}₂ are obtained using equations (4) and (5).

At 320, an incoming email message is received, and at 325, vector {overscore (v)}₃ is constructed from the incoming email message using equation (6). At 330, a measure of closeness K is obtained using equation (7). As explained above, the measure of closeness determines whether the new email message is legitimate, unsolicited or ambiguous.

At 335, a determination is made whether the new email message is legitimate. If the angle between {overscore (v)}₃ and {overscore (v)}₁ is smaller than the angle between {overscore (v)}₃ and {overscore (v)}₂, at 345, the new email message is classified as legitimate. In one embodiment, legitimate email messages may be forwarded to the intended recipient.

At 350 a determination is made whether the new email message is unsolicited. If the angle between {overscore (v)}₃ and {overscore (v)}₁ is larger than the angle between {overscore (v)}₃ and {overscore (v)}₂, at 340, the new email message is classified as unsolicited. In one embodiment, the new email message that is classified as unsolicited may be automatically discarded. Alternate embodiments may provide for the newly classified legitimate and unsolicited messages to form part of the email training corpus T.

However, if the angle between {overscore (v)}₃ and {overscore (v)}₁ is approximately equal to the angle between {overscore (v)}₃ and {overscore (v)}₂, at 355 the email message may be classified as ambiguous. In one embodiment, ambiguous email messages are forwarded to the intended recipient of the email message to eliminate the ambiguity and to classify the email message as legitimate or unsolicited. In one embodiment, after a recipient classifies the email message, the email message is included in the email training corpus, and new semantic anchors are calculated. Thus, the next time an email message with content similar to the ambiguous email message is received, the email filtering system automatically classifies the email as legitimate or unsolicited.

Embodiments of the email filtering system may be employed individually on a machine for a particular user or on a central machine, e.g., an email server, to filter out email messages for a group of email recipients. Alternate embodiments may include employing the email filtering system on a server or other device that communicates with a remote user, for example, a user using a wireless device such as a wireless personal digital assistant (PDA) or wireless palm top computer, so that the limited memory of the wireless device is not unnecessarily filled with unsolicited email messages. Alternate embodiments may employ the email filtering system on the PDA and unsolicited messages may be discarded as soon as they are received.

FIG. 4 illustrates one embodiment of an apparatus that may be used to filter email messages. Although the embodiment described uses a personal computer, other devices including wireless devices such as cellular phones and personal digital assistants may also be used. One embodiment of the present invention may be implemented on a personal computer (PC) architecture. It will be apparent to those of ordinary skill in the art that alternative computer system architectures or other processor, programmable or electronic-based devices may also be employed.

In general, such computer systems as illustrated by FIG. 4 include a processor 402 coupled through a bus 401 to a random access memory (RAM) 403, a read only memory (ROM) 404, and a mass storage device 407. Mass storage device 407 represents a persistent data storage device, such as a floppy disk drive, fixed disk drive (e.g., magnetic, optical, magneto-optical, or the like), or streaming tape drive. Processor 402 may be any of a wide variety of general purpose processors or microprocessors (such as the Pentium® processor manufactured by Intel® Corporation), a special purpose processor, or a specifically programmed logic device.

Display device 405 is coupled to processor 402 through bus 401 and provides graphical output for computer system 400. Input devices 406 such as a keyboard or mouse are coupled to bus 401 for communicating information and command selections to processor 402. Also coupled to processor 402 through bus 401 is an input/output interface 410 which can be used to control and transfer data to electronic devices (printers, other computers, etc.) connected to computer system 400. Computer system 400 includes network devices 408 for connecting computer system 400 to a network 414 through which email messages may be received, e.g., from remote device 412. Network devices 408, may include Ethernet devices, phone jacks and satellite links. It will be apparent to one of ordinary skill in the art that other network devices may also be utilized.

One embodiment of the invention may be stored entirely as a software product on mass storage 407. Another embodiment of the invention may be embedded in a hardware product, for example, in a printed circuit board, in a special purpose processor, or in a specifically programmed logic device communicatively coupled to bus 401. Still other embodiments of the invention may be implemented partially as a software product and partially as a hardware product.

Embodiments of the invention maybe represented as a software product stored on a machine-accessible medium (also referred to as a computer-accessible medium or a processor-accessible medium) as illustrated in FIG. 5. The machine-accessible medium may be any type of magnetic, optical, or electrical storage medium including a diskette, CD-ROM, memory device (volatile or non-volatile), or similar storage mechanism. The machine-accessible medium may contain various sets of instructions, code sequences, configuration information, or other data. Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described invention may also be stored on the machine-accessible medium. FIG. 5 illustrates a machine-accessible medium that includes instructions that when executed by a machine causes the machine to perform operations comprising determining a first semantic anchor 520 corresponding with a first group of messages, for example, legitimate email messages. Determining a second semantic anchor 525 corresponding with a second group of messages, for example, unsolicited email messages. The first and the second semantic anchors are determined as described earlier using instructions that implement the email training unit 505, instructions that implement the co-occurrences unit 510 and instructions that implement the singular value decomposition unit 515. The machine-accessible medium includes further instructions for determining a vector corresponding with an incoming message and instructions for comparing the vector with at least one of the first semantic anchor 520 and the second semantic anchor 525 to obtain at least one comparison value. The vector corresponding with an incoming message is determined using instructions to implement the email conversion unit 555. The instructions for comparing the vector 555 with at least one of the first semantic anchor 520 and the second semantic anchor 525 to obtain at least one comparison value comprise instructions that implement the calculation unit 560. The machine-accessible medium includes further instructions to filter the incoming message based on the comparison value. The instructions to filter the incoming message based on the comparison value, comprises instructions for implementing logic unit 565. In particular, the instructions to filter the incoming message comprises instructions to determine whether the incoming message is unsolicited email 570, legitimate email 575, or ambiguous email 580.

Experiments conducted using one embodiment of the method and apparatus of the present invention revealed that for a database comprising one legitimate email message N₁ and one unsolicited email message N₂ in the training corpus T the email filtering system performed reasonably well. An exponential increase in the performance of the email filtering system occurred as the values of N₁ and N₂ approached 50. Subsequent increases in the values of N₁ and N₂ revealed a relative plateau in the performance of the email filtering system. In one embodiment, more than 95% of a user's incoming email messages were properly classified, with approximately less than 3% of the user's email messages being passed to the user for disambiguation. A significantly lower misclassification rate was observed as compared with the misclassification rate of prior art methods.

While there has been illustrated and described what are presently considered to be example embodiments of the present invention, it will be understood by those skilled in the art that various other modifications may be made, and equivalents may be substituted, without departing from the true scope of the invention. Additionally, many modifications may be made to adapt a particular situation to the teachings of the present invention without departing from the central inventive concept described herein. Therefore, it is intended that the present invention not be limited to the particular embodiments disclosed, but that the invention include all embodiments falling within the scope of the appended claims. 

1. A method for filtering messages comprising: determining a first semantic representation corresponding to a first group of messages and a second semantic representation corresponding to a second group of messages; determining a mathematical representation corresponding to an incoming message; comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain at least one of a first comparison value and a second comparison value; and filtering the incoming message through-classifying the incoming message between the first and second groups based on at least one of the first comparison value and the second comparison value.
 2. A method as in claim 1, wherein said second group of messages are defined as unsolicited messages, and said first group of messages are defined to not be unsolicited messages.
 3. A method as in claim 2, wherein the second semantic representation and the first semantic representation are mathematical vectors obtained respectively from previously received unsolicited messages of a training message corpus and previously received messages defined not to be unsolicited messages of the training message corpus.
 4. A method as in claim 3, wherein the training message corpus is used to obtain a matrix W comprising a word distribution factor.
 5. A method as in claim 4, wherein the matrix W is used to generate the first semantic representation and the second semantic representation using singular value decomposition.
 6. A method as in claim 1, wherein the first group of messages, the second group of messages and the incoming message comprise messages from at least one of email messages, email attachments, and computer programs.
 7. A method as in claim 1, wherein determining a mathematical representation corresponding to an incoming message comprises using singular value decomposition to generate the mathematical representation corresponding to the incoming message.
 8. A method as in claim 1, wherein comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises determining an angle between the mathematical representation corresponding to the incoming message and at least one of the first semantic representation and the second semantic representation.
 9. A method as in claim 1, wherein comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises comparing the length of a normal between the first semantic representation and the mathematical representation corresponding to the incoming message, and the length of a normal between the second semantic representation and the mathematical representation corresponding to the incoming message.
 10. A method as in claim 1, wherein comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises permitting a user to decide whether the incoming message is from the first group of messages or from the second group of messages when the first comparison value is substantially equal to the second comparison value.
 11. A method as in claim 10, wherein filtering the incoming message based on the first comparison value and the second comparison value comprises at least one of automatically filtering the incoming messages, and tagging the incoming message.
 12. A method as in claim 11, wherein tagging the incoming message comprises at least one of tagging the incoming message with a first tag for a message corresponding with the first group of messages, tagging the incoming message with a second tag for a message corresponding with the second group of messages, and tagging the incoming message with a third tag when the first comparison value is substantially equal to the second comparison value.
 13. An article of manufacture comprising: a machine-accessible medium including instructions that, when executed by a machine, causes the machine to perform operations comprising: determining a first semantic representation corresponding to a first group of messages and a second semantic representation corresponding to a second group of messages; determining a mathematical representation corresponding to an incoming message; comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain at least one of a first comparison value and a second comparison value; and filtering the incoming message through classifying the incoming message between the first and second groups based on at least one of the first comparison value and the second comparison value.
 14. An article of manufacture as in claim 13, wherein said second group of messages are defined as unsolicited messages, and said first group of messages are defined to not be unsolicited messages.
 15. An article of manufacture as in claim 14, wherein said instructions for obtaining the second semantic representation and the first semantic representation include further instructions for obtaining mathematical vectors respectively from previously received unsolicited messages of a training message corpus and previously received messages defined not to be unsolicited messages of the training message corpus.
 16. An article of manufacture as in claim 15, wherein said instructions for obtaining vectors using a training message corpus comprises further instructions for obtaining a matrix W comprising a word distribution factor.
 17. An article of manufacture as in claim 16, wherein said instructions for obtaining matrix W comprises further instructions for generating the first semantic representation and the second semantic representation using singular value decomposition.
 18. An article of manufacture as in claim 13, wherein said first group of messages, said second group of messages and said incoming message comprise messages from at least one of email messages, email attachments, and computer programs.
 19. An article of manufacture as in claim 13, wherein said instructions for determining a mathematical representation corresponding to an incoming message comprises further instruction for using singular value decomposition to generate the mathematical representation corresponding to the incoming message.
 20. An article of manufacture as in claim 13, wherein said instructions for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises further instructions for determining an angle between the mathematical representation corresponding to the incoming message and at least one of the first semantic representation and the second semantic representation.
 21. An article of manufacture as in claim 13, wherein said instructions for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises further instructions for comparing the length of a normal between the first semantic representation and the mathematical representation corresponding to the incoming message, and the length of a normal between the second semantic representation and the mathematical representation corresponding to the incoming message.
 22. An article of manufacture as in claim 13, wherein said instructions for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises further instructions for permitting a user to decide whether the incoming message is from the first group of messages or from the second group of messages when the first comparison value is substantially equal to the second comparison value.
 23. An article of manufacture as in claim 22, wherein said instructions for filtering the incoming message based on the first comparison value and the second comparison value comprises further instructions for at least one of automatically filtering the incoming messages, and tagging the incoming message.
 24. An article of manufacture as in claim 23, wherein said instructions for tagging the incoming message comprises further instructions for at least one of, tagging the incoming message with a first tag for a message corresponding with the first group of messages, tagging the incoming message with a second tag for a message corresponding with the second group of messages, and tagging the incoming message with a third tag when the first comparison value is substantially equal to the second comparison value.
 25. A computer system comprising: a bus; a data storage device coupled to said bus; a processor coupled to said data storage device; a singular value decomposition unit communicatively coupled to the processor to determine a first semantic representation corresponding to a first group of messages and a second semantic representation corresponding to a second group of messages; an incoming email conversion unit communicatively coupled to the singular value decomposition unit to determine a mathematical representation corresponding to an incoming message; a logic unit communicatively coupled to the incoming email conversion unit and the singular value decomposition unit to compare the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain at least one of a first comparison value and a second comparison value, and to filter the incoming message through classifying the incoming message between the first and second groups based on at least one of the first comparison value and the second comparison value.
 26. A computer system as in claim 25, wherein said second group of messages are defined as unsolicited messages, and said first group of messages are defined to not be unsolicited messages.
 27. A computer system as in claim 26, wherein the second semantic representation and the first semantic representation are vectors obtained respectively from previously received unsolicited messages of a training message corpus and previously received messages defined not to be unsolicited messages of the training message corpus.
 28. A computer system as in claim 27, wherein the training message corpus is used to obtain a matrix W comprising a word distribution factor.
 29. A computer system as in claim 28, wherein the matrix W is used to generate the first semantic representation and the second semantic representation using singular value decomposition.
 30. A computer system as in claim 25, wherein the first group of messages, the second group of messages and the incoming message comprise messages from at least one of email messages, email attachments, transcribed audio messages, and computer programs.
 31. A computer system as in claim 25, wherein an incoming email conversion unit communicatively coupled to the singular value decomposition unit to determine a mathematical representation corresponding to an incoming message comprises the incoming email conversion unit using singular value decomposition to generate the mathematical representation corresponding to the incoming message.
 32. A computer system as in claim 25, wherein the logic unit communicatively coupled to the incoming email conversion unit and the singular value decomposition unit to compare the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises the logic unit to determine an angle between the mathematical representation corresponding to the incoming message and at least one of the first semantic representation and the second semantic representation.
 33. A computer system as in claim 25, wherein the logic unit communicatively coupled to the incoming email conversion unit and the singular value decomposition unit to compare the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises the logic unit to compare the length of a normal between the first semantic representation and the mathematical representation corresponding to the incoming message, and the length of a normal between the second semantic representation and the mathematical representation corresponding to the incoming message.
 34. A computer system as in claim 25, wherein the logic unit communicatively coupled to the incoming email conversion unit and the singular value decomposition unit to compare the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises the logic unit to permit a user to decide whether the incoming message is from the first group of messages or from the second group of messages when the first comparison value is substantially equal to the second comparison value.
 35. A computer system as in claim 34, wherein the logic unit to filter the incoming message based on the first comparison value and the second comparison value comprises the logic unit to at least one of automatically filter the incoming messages, and to tag the incoming message.
 36. A computer system as in claim 35, wherein the logic unit to tag the incoming message comprises at least one of the logic unit to tag the incoming message with a first tag for a message corresponding with the first group of messages, the logic unit to tag the incoming message with a second tag for a message corresponding with the second group of messages, and the logic unit to tag the incoming message with a third tag when the first comparison value is substantially equal to the second comparison value.
 37. An apparatus comprising: means for determining a first semantic representation corresponding to a first group of messages and a second semantic representation corresponding to a second group of messages; means for determining a mathematical representation corresponding to an incoming message; means for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain at least one of a first comparison value and a second comparison value; and means for filtering the incoming message through classifying the incoming message between the first and second groups based on at least one of the first comparison value and the second comparison value.
 38. An apparatus as in claim 37, wherein said second group of messages are defined as unsolicited messages, and said first group of messages are defined to not be unsolicited messages.
 39. An apparatus as in claim 38, wherein the second semantic representation and the first semantic representation are vectors obtained respectively from previously received unsolicited messages of a training message corpus and previously received messages defined not to be unsolicited messages of the training message corpus.
 40. An apparatus as in claim 39, wherein the training message corpus is used to obtain a matrix W comprising a word distribution factor.
 41. An apparatus as in claim 40, wherein the matrix W is used to generate the first semantic representation and the second semantic representation using singular value decomposition.
 42. An apparatus as in claim 37, wherein the first group of messages, the second group of messages and the incoming message comprise messages from at least one of email messages, email attachments, and computer programs.
 43. An apparatus as in claim 37, wherein the means for determining a mathematical representation corresponding to an incoming message comprises means for using singular value decomposition to generate the mathematical representation corresponding to the incoming message.
 44. An apparatus as in claim 37, wherein the means for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises means for determining an angle between the mathematical representation corresponding to the incoming message and at least one of the first semantic representation and the second semantic representation.
 45. An apparatus as in claim 37, wherein the means for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation comprises means for comparing the length of a normal between the first semantic representation and the mathematical representation corresponding to the incoming message, and the length of a normal between the second semantic representation and the mathematical representation corresponding to the incoming message.
 46. An apparatus as in claim 37, wherein the means for comparing the mathematical representation corresponding to the incoming message with at least one of the first semantic representation and the second semantic representation to obtain a first comparison value and a second comparison value comprises means for permitting a user to decide whether the incoming message is from the first group of messages or from the second group of messages when the first comparison value is substantially equal to the second comparison value.
 47. An apparatus as in claim 46, wherein the means for filtering the incoming message based on the first comparison value and the second comparison value comprises means for at least one of automatically filtering the incoming messages, and tagging the incoming message.
 48. An apparatus as in claim 47, wherein the means for tagging the incoming message comprises means for at least one of tagging the incoming message with a first tag for a message corresponding with the first group of messages, tagging the incoming message with a second tag for a message corresponding with the second group of messages, and tagging the incoming message with a third tag when the first comparison value is substantially equal to the second comparison value.
 49. A method as in claim 3, wherein the second semantic representation corresponds to a centroid of the previously received unsolicited messages of a training message corpus in the semantic vector space; and the first semantic representation corresponds to a centroid of the previously received messages defined not to be unsolicited messages of the training message corpus in the semantic vector space.
 50. A method as in claim 1, wherein each of the first and second semantic representations represent a vector in a semantic vector space; and the vector corresponding to the incoming message is determined in the semantic vector space.
 51. A method as in claim 50, wherein each of the first and second semantic representations are determined based on first numbers of occurrences of a set of words in the first group and second numbers of occurrences of the set of words in the second group.
 52. A method as in claim 51, wherein said determining the first semantic representation and the second semantic representation comprises: determining a first matrix, the first matrix comprising: a first column determined based on the first numbers of occurrences of the set of words in the first group; and a second column determined based on the second numbers of occurrences of the set of words in the second group; and determining the first and second semantic representation based on a right singular matrix of singular value decomposition of the first matrix.
 53. A method as in claim 52, wherein: the first column is determined based on frequencies of occurrences of the set of words in the first group; and the second column determined based on frequencies of occurrences of the set of words in the second group.
 54. A method as in claim 52, wherein said determining the mathematical representation corresponding to the incoming message comprises: determining third numbers of occurrences of the set of words in the incoming message; and determining the mathematical representation corresponding to the incoming message based on the third numbers of occurrences of the set of words in the incoming message and a left singular matrix of singular value decomposition of the first matrix. 